A Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
نویسندگان
چکیده مقاله:
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
منابع مشابه
Diophantine quadruples and Fibonacci numbers
A Diophantine m-tuple is a set of m positive integers with the property that product of any two of its distinct elements is one less then a square. In this survey we describe some problems and results concerning Diophantine m-tuples and their connections with Fibonacci numbers.
متن کاملCycles in the Generalized Fibonacci Sequence modulo a Prime
Since their invention in the thirteenth century, Fibonacci sequences have intrigued mathematicians. As well as modeling the population patterns of overly energetic rabbits, however, they have sparked developments in more serious mathematics. For example, generalized Fibonacci sequences crop up in all manner of situations, from fiber optic networks [3] to computer algorithms [1] to probability t...
متن کاملGeneralized Fibonacci recurrences and the lex-least De Bruijn sequence
The skew of a binary string is the difference between the number of zeroes and the number of ones, while the length of the string is the sum of these two numbers. We consider certain suffixes of the lexicographicallyleast de Bruijn sequence at natural breakpoints of the binary string. We show that the skew and length of these suffixes are enumerated by sequences generalizing the Fibonacci and L...
متن کاملDiophantine approximation and Diophantine equations
The first course is devoted to the basic setup of Diophantine approximation: we start with rational approximation to a single real number. Firstly, positive results tell us that a real number x has “good” rational approximation p/q, where “good” is when one compares |x − p/q| and q. We discuss Dirichlet’s result in 1842 (see [6] Course N◦2 §2.1) and the Markoff–Lagrange spectrum ([6] Course N◦1...
متن کاملOne-dimensional Fibonacci Quasilattices and Their Application to the Euclidean Algorithm and Diophantine Equations
The one-dimensional quasilattices L lying in the square Fibonacci quasilattice F2 = F×F are classified; here F is the one-dimensional Fibonacci quasilattice. It is proved that there exists a countable set of similarity classes of quasilattices L in F2 (fine classification), and also four classes of local equivalence (rough classification). Asymptotic distributions of points in quasilattices L a...
متن کاملThe Generating Function of the Generalized Fibonacci Sequence
Using tools of the theory of orthogonal polynomials we obtain the generating function of the generalized Fibonacci sequence established by Petronilho for a sequence of real or complex numbers {Qn}n=0 defined by Q0 = 0, Q1 = 1, Qm = ajQm 1 + bjQm 2, m ⌘ j (mod k), where k 3 is a fixed integer, and a0, a1, . . . , ak 1, b0, b1, . . . , bk 1 are 2k given real or complex numbers, with bj 6= 0 for 0...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 8 شماره None
صفحات 111- 121
تاریخ انتشار 2013-10
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023